key lemma

См. также в других словарях:

• Forking lemma — The forking lemma is any of a number of related lemmas in cryptography research. The lemma states that if an adversary (typically a probabilistic Turing machine), on inputs drawn from some distribution, produces an output that has some property… …   Wikipedia

• Leftover hash-lemma — Imagine that you have a secret key X that has n uniform random bits, and you would like to use this secret key to encrypt a message. Unfortunately, you were a bit careless with the key, and know that an adversary was able to learn about t < n… …   Wikipedia

• Ping-pong lemma — In mathematics, the ping pong lemma, or table tennis lemma, is any of several mathematical statements which ensure that several elements in a group acting on a set freely generate a free subgroup of that group.HistoryThe ping pong argument goes… …   Wikipedia

• Neyman–Pearson lemma — In statistics, the Neyman Pearson lemma, named after Jerzy Neyman and Egon Pearson, states that when performing a hypothesis test between two point hypotheses H0: θ = θ0 and H1: θ = θ1, then the likelihood ratio test …   Wikipedia

• Neyman-Pearson lemma — In statistics, the Neyman Pearson lemma states that when performing a hypothesis test between two point hypotheses H 0: θ = θ 0 and H 1: θ = θ 1, then the likelihood ratio test which rejects H 0 in favour of H 1 when:Lambda(x)=frac{ L( heta {0}… …   Wikipedia

• Schwartz-Zippel lemma and testing polynomial identities — Polynomial identity testing is the problem of determining whether a given multivariate polynomial is the0 polynomial or identically equal to 0. The input to the problem is an n variable polynomial over a fieldF. It can occur in the following… …   Wikipedia

• Engel theorem — In representation theory, Engel s theorem is one of the basic theorems in the theory of Lie algebras; it asserts that for a Lie algebra two concepts of nilpotency are identical. A useful form of the theorem says that if a Lie algebra L of… …   Wikipedia

• Neighborly polytope — In geometry and polyhedral combinatorics, a k neighborly polytope is a convex polytope in which every set of k or fewer vertices forms a face. For instance, a 2 neighborly polytope is a polytope in which every pair of vertices is connected by an… …   Wikipedia

• Van Kampen diagram — In the mathematical area of geometric group theory, a van Kampen diagram is a planar diagram used to represent the fact that a particular word among the generators of a group given by a group presentation represents the identity element in that… …   Wikipedia

• Vector space — This article is about linear (vector) spaces. For the structure in incidence geometry, see Linear space (geometry). Vector addition and scalar multiplication: a vector v (blue) is added to another vector w (red, upper illustration). Below, w is… …   Wikipedia

• Small cancellation theory — In the mathematical subject of group theory, small cancellation theory studies groups given by group presentations satisfying small cancellation conditions, that is where defining relations have small overlaps with each other. It turns out that… …   Wikipedia